Gödel’s correspondence on proof theory and constructive mathematics

نویسنده

  • W. W. Tait
چکیده

The volumes of Gödel’s collected papers under review consist almost entirely of a rich selection of his philosophical/scientific correspondence, including English translations face-to-face with the originals when the latter are in German. The residue consists of correspondence with editors (more amusing than of any scientific value) and five letters from Gödel to his mother, in which explains to her his religious views. The term “selection” is strongly operative here: The editors state the total number of items of personal and scientific correspondence in Gödel’s Nachlass to be around thirty-five hundred. The correspondence selected involves fifty correspondents, and the editors list the most prominent of these: Paul Bernays, William Boone, Rudolph Carnap. Paul Cohen, Burton Dreben, Jacques Herbrand, Arend Heyting, Karl Menger, Ernest Nagel, Emil Post, Abraham Robinson, Alfred Tarski, Stanislaw Ulam, John von Neumann, Hao Wang, and Ernest Zermelo. The correspondence is arranged alphebetically, with A-G in Volume IV. The imbalance results from the disproportionate size of the Bernays correrspondence: 85 letters are included (almost all of them), spanning 234 pages) including the face-to-face originals and translations). Each volume contains a calendar of all the items included in the volume together with separate calendars listing all known correspondence (whether included or not) with the major correspondents (seven in Volume IV and ten in Volume V). Let me recommend to the reader the review of these same volumes by Paolo Mancosu in the Notre Dame Journal of Formal Logic 45 (2004):109125. This essay very nicely describes much of the correspondence in terms of broad themes relating, especially, to the incompleteness theorems—their origins in Gödel’s thought, their reception, their impact on Hilbert’s program,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intuitionistic Type Theory

Intuitionistic Type Theory (also Constructive Type Theory or Martin-Löf Type Theory) is a formal logical system and philosophical foundation for constructive mathematics (link). It is a fullscale system which aims to play a similar role for constructive mathematics as Zermelo-Fraenkel Set Theory (link) does for classical mathematics. It is based on the propositions-as-types principle and clarif...

متن کامل

Gödel’s interpretation of intuitionism

Gödel regarded the Dialectica interpretation as giving constructive content to intuitionism, which otherwise failed to meet reasonable conditions of constructivity. He founded his theory of primitive recursive functions, in which the interpretation is given, on the concept of computable function of finite type. I will 1) criticize this foundation, 2) propose a quite different one, and 3) note t...

متن کامل

Fuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma

The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.

متن کامل

An analysis of the constructive content of Henkin’s proof of Gödel’s completeness theorem DRAFT

Gödel’s completeness theorem for first-order logic is one of the best-known theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula. There are various views on the completeness theorem, various presentations, various formalisations, various proofs of it. We survey the most standard different approaches and eventua...

متن کامل

Algorithm and proof as Ω-invariance and transfer: A new model of computation in nonstandard analysis

We propose a new model of computation based on Nonstandard Analysis. Intuitively, the role of ‘algorithm’ is played by a new notion of finite procedure, called Ω-invariance and inspired by physics, from Nonstandard Analysis. Moreover, the role of ‘proof’ is taken up by the Transfer Principle from Nonstandard Analysis. We obtain a number of results in Constructive Reverse Mathematics to illustra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006